Finding Pseudo-repetitions
نویسندگان
چکیده
Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences. We solve fundamental algorithmic questions on pseudo-repetitions by application of insightful combinatorial results on words. More precisely, we efficiently decide whether a word is a pseudorepetition and find all the pseudo-repetitive factors of a word. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
Testing Generalised Freeness of Words
Pseudo-repetitions are a natural generalisation of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism (anti-/morphism, for short). We approach the problem of deciding efficiently, for a word w and a literal anti-/morphism f , whether w contains an instance of a given pattern involving a variab...
متن کاملDiscovering Hidden Repetitions in Words
Pseudo-repetitions are a natural generalization of the classical notion of repetitions in sequences: they are the repeated concatenation of a word and its encoding under a certain morphism or antimorphism. We approach the problem of deciding whether there exists an anti-/morphism for which a word is a pseudo-repetition. In other words, we try to discover whether a word has a hidden repetitive s...
متن کاملRepetitions in Text and Finite Automata
Abstract: A general way to find repetitions of factors in a given text is shown. We start with a classification of repetitions. The general models for finding exact repetitions in one string and in a finite set of strings are introduced. It is shown that d-subsets created during determinization of nondeterministic factor automata contain all information concerning repetitions of factors. The pr...
متن کاملGenerating the Pseudo-Powers of a Word
The notions of power of word, periodicity and primitivity are intrinsically connected to the operation of catenation, that dynamically generates word repetitions. When considering generalizations of the power of a word, other operations will be the ones that dynamically generate such pseudo-repetitions. In this paper we define and investigate the operation of θ-catenation that gives rise to the...
متن کاملFinding Maximal Repetitions in a Word in Linear Time
A repetition in a word is a subword with the period of at most half of the subword length. We study maximal repetitions occurring in , that is those for which any extended subword of has a bigger period. The set of such repetitions represents in a compact way all repetitions in . We first prove a combinatorial result asserting that the sum of exponents of all maximal repetitions of a word of le...
متن کامل